The Perturbation Bound for the Spectral Radius of a Nonnegative Tensor
نویسندگان
چکیده
Abstract. In this paper, we study the perturbation bound for the spectral radius of an mthorder n-dimensional non-negative tensor A. The main contribution of this paper is to show that when A is perturbed to a non-negative tensor à by ∆A, the absolute difference between the spectral radii of A and à is bounded by the largest magnitude of the ratio of the i-th component of ∆Axm−1 and the i-th component xm−1, where x is an eigenvector associated with the largest eigenvalue of A in magnitude and its entries are positive. We further derive the bound in terms of the entries of A only when x is not known in advance. Based on the perturbation analysis, we make use of the NQZ algorithm to estimate the spectral radius of a non-negative tensor in general. On the other hand, we study the backward error matrix ∆A and obtain its smallest error bound for its perturbed largest eigenvalue and associated eigenvector of an irreducible non-negative tensor. Based on the backward error analysis, we can estimate the stability of computation of the largest eigenvalue of an irreducible non-negative tensor by the NQZ algorithm. Numerical examples are presented to illustrate the theoretical results of our perturbation analysis.
منابع مشابه
The Sign-Real Spectral Radius for Real Tensors
In this paper a new quantity for real tensors, the sign-real spectral radius, is defined and investigated. Various characterizations, bounds and some properties are derived. In certain aspects our quantity shows similar behavior to the spectral radius of a nonnegative tensor. In fact, we generalize the Perron Frobenius theorem for nonnegative tensors to the class of real tensors.
متن کاملA new bound for the spectral radius of nonnegative tensors
By estimating the ratio of the smallest component and the largest component of a Perron vector, we provide a new bound for the spectral radius of a nonnegative tensor. And it is proved that the proposed result improves the bound in (Li and Ng in Numer. Math. 130(2):315-335, 2015).
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملA Necessary and Sufficient Condition for Existence of a Positive Perron Vector
In 1907, Oskar Perron showed that a positive square matrix has a unique largest positive eigenvalue with a positive eigenvector. This result was extended to irreducible nonnegative matrices by Geog Frobenius in 1912, and to irreducible nonnegative tensors and weakly irreducible nonnegative tensors recently. This result is a fundamental result in matrix theory and has found wide applications in ...
متن کاملFinding the Largest Eigenvalue of a Nonnegative Tensor
In this paper we propose an iterative method for calculating the largest eigenvalue of an irreducible nonnegative tensor. This method is an extension of a method of Collatz (1942) for calculating the spectral radius of an irreducible nonnegative matrix. Numerical results show that our proposed method is promising. We also apply the method to studying higher-order Markov chains.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Numerical Analysis
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014